منابع مشابه
Equational properties of stratified least fixed points
Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove that this new operation satisfies ‘the standard’ identities of fixed point operations as described by the axioms of iteration theories. We also study this new f...
متن کاملLeast and Greatest Fixed Points in Ludics
Various logics have been introduced in order to reason over (co)inductive specifications and, through the Curry-Howard correspondence, to study computation over inductive and coinductive data. The logic μMALL is one of those logics, extending multiplicative and additive linear logic with least and greatest fixed point operators. In this paper, we investigate the semantics of μMALL proofs in (co...
متن کاملLeast and greatest fixed points of a while semantics function
The meaning of a program is given by specifying the function (from input to output) that corresponds to the program. The denotational semantic definition, thus maps syntactical things into functions. A relational semantics is a mapping of programs to relations. We consider that the input-output semantics of a program is given by a relation on its set of states. In a nondeterministic context, th...
متن کاملPartial and total correctness as greatest and least fixed points
This paper studies Hoare triples in the context of any programming language specified by a small-step, possibly non-deterministic, operational semantics. We explain how the partial correctness interpretation of the triple can be characterised as the greatest fixed point of a function, and how the total correctness interpretation can be seen as the least fixed point of that very same function. I...
متن کاملComputing Least Fixed Points of Probabilistic Systems of Polynomials
We study systems of equations of the form X1 =f1(X1, . . .,Xn), . . . ,Xn = fn(X1, . . . ,Xn) where each fi is a poly-nomial with nonnegative coefficients that add up to 1. The leastnonnegative solution, say μ, of such equation systems is central toproblems from various areas, like physics, biology, computational lin-guistics and probabilistic program verification. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1976
ISSN: 0304-3975
DOI: 10.1016/0304-3975(76)90031-1